On Lazy Commutation
Identifieur interne : 003922 ( Main/Exploration ); précédent : 003921; suivant : 003923On Lazy Commutation
Auteurs : Nachum Dershowitz [Israël]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating well-foundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used in termination proofs.
Url:
DOI: 10.1007/978-3-642-01748-3_5
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001C65
- to stream Istex, to step Curation: 001C44
- to stream Istex, to step Checkpoint: 000A29
- to stream Main, to step Merge: 003A00
- to stream Main, to step Curation: 003922
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">On Lazy Commutation</title>
<author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:7B4EBA0936EF30BA752FFBA178775EC8E882C32D</idno>
<date when="2009" year="2009">2009</date>
<idno type="doi">10.1007/978-3-642-01748-3_5</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-MQS305Q1-V/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001C65</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001C65</idno>
<idno type="wicri:Area/Istex/Curation">001C44</idno>
<idno type="wicri:Area/Istex/Checkpoint">000A29</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000A29</idno>
<idno type="wicri:doubleKey">0302-9743:2009:Dershowitz N:on:lazy:commutation</idno>
<idno type="wicri:Area/Main/Merge">003A00</idno>
<idno type="wicri:Area/Main/Curation">003922</idno>
<idno type="wicri:Area/Main/Exploration">003922</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">On Lazy Commutation</title>
<author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name>
<affiliation wicri:level="1"><country xml:lang="fr">Israël</country>
<wicri:regionArea>School of Computer Science, Tel Aviv University, Ramat Aviv</wicri:regionArea>
<wicri:noRegion>Ramat Aviv</wicri:noRegion>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We investigate combinatorial commutation properties for reordering a sequence of two kinds of steps, and for separating well-foundedness of unions of relations. To that end, we develop the notion of a constricting sequence. These results can be applied, for example, to generic path orderings used in termination proofs.</div>
</front>
</TEI>
<affiliations><list><country><li>Israël</li>
</country>
</list>
<tree><country name="Israël"><noRegion><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003922 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003922 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Exploration |type= RBID |clé= ISTEX:7B4EBA0936EF30BA752FFBA178775EC8E882C32D |texte= On Lazy Commutation }}
This area was generated with Dilib version V0.6.33. |